ROW CONVEX TABLEAUX AND BOTT–SAMELSON VARIETIES

A straightening algorithm for row-convex tableaux

We produce a new basis for the Schur and Weyl modules associated to a row-convex shape D. The basis is indexed by new class of \straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is proved via a new straightening algorithm for expanding elements of the representation into this basis. For skew shapes, this algorithm specializes to the classi...

Straightening Laws for Row-Convex Tableaux

We introduce the notion of a straight tableau and prove that the straight tableaux of xed row-convex shape form a basis for the GL n -representations and the general linear Lie superalgebra representations associated to the given shape. We provide a straightening algorithm for expressing arbitrary tableaux in terms of straight tableaux. These techniques can be modi ed to provide bases for repre...

Row-convex tableaux and the combinatorics of initial terms

We characterize the initial terms under a diagonal term order of the supersymmetric Schur/Weyl module S(V V ) associated to a row-convex shape D. We show the biwords corresponding to the initial terms of S are closed under dual-Knuth equivalence and that the recording tableaux for these words are decomposable in the sense of [10]. We consider the natural action of bases of S in which the elemen...

A Straighteng Algorithm for Row-convex Tableaux. 0

Counting tableaux with row and column bounds

It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the i'th row are bounded by some nondecreasing upper and lower bounds which depend on i can be written in form of a determinant of size r. We show that the generating function for tableaux of a given skew shape with r rows and c columns where the parts in the i'th row are bounded by n...